Search results
11 packages found
A fixed-size auto-overwriting stack.
A suite of circular data structures, including deques, lists, maps, queues, sets and stacks.
- buffer
- cache
- circular
- collection
- cyclic
- data
- data-structure
- deque
- doubly-linked-list
- linked-list
- linked
- list
- map
- queue
- View more
Misc TS data structures such as Sets, Maps and Collections
Common data structures implementation for javascript
- javascript
- data
- structure
- structures
- unit
- test
- coverage
- 100%
- circular
- buffer
- priorit
- yqueue
- stack
- linked
- View more
very fast double-ended queue, stack and circular buffer
Simple cyclic array (buffer) implementation
Like a stack, the queue is a linear data structure that stores items in either a First In First Out (FIFO) or Last In First Out (LIFO) manner. With FIFO, the least recently added item is removed first, while with LIFO, the most recently added item is remo
Like a stack, the queue is a linear data structure that stores items in either a First In First Out (FIFO) or Last In First Out (LIFO) manner. With FIFO, the least recently added item is removed first, while with LIFO, the most recently added item is remo
- flag
- move
- babel
- callbind
- Push
- defineProperty
- phone
- command
- stateless
- RegExp.prototype.flags
- typedarray
- String.prototype.trim
- call-bind
- negative
- View more
[](https://travis-ci.org/xpl/stacktracey) [](https://ci.appveyor.com/project/xpl/stacktra
- gestures
- util.inspect
- indicator
- require
- es2017
- ECMAScript 3
- mru
- cjk
- json-schema-validator
- toSorted
- take
- filter
- look-up
- packages
- View more
A small circular/ring buffer implementation in TypeScript.
Collection of elements where insert, delete happens only at the ends.